A Preprocessing Algorithm to Implement Greedy-MRS for Selecting a Hierarchical Reliable Multicast Proxy
نویسنده
چکیده
Many hierarchical reliable multicast (HRM) protocols deploy repair proxies that perform local recovery and feedback consolidation. Placement of proxies is a key design issue in HRM network. The objective of Greedy-MRS algorithm is to place the HRM proxy in a single iteration, but it requires communication with routers frequently to find the efficient proxy. The objective of preprocessing step is to communicate with routers to implement Greedy– MRS algorithm with minimum number of communications between routers. Space needed in the router to store data to find efficient placement of proxies for HRM network is constant and it is independent of number of children. Simulation results indicate that this preprocessing step providing good levels of space and communication complexity and scalability of this algorithm depends on height of subtree.
منابع مشابه
Efficient placement of proxies for hierarchical reliable multicast
The primary focus of this paper is the design of efficient algorithm for the calculation of solution to the placement of proxies for performance optimization in hierarchical reliable multicast (HRM). Proxy is introduced to localize feedback and retransmission, and therefore significantly depress traffic redundancy and reduce latency. Placement of proxies is a key issue in HRM. This paper theore...
متن کاملHierarchical Reliable Multicast: Performance Analysis and Optimal Placement of Proxies
This paper studies the use of multicast together with proxy nodes for reliably disseminating data from a single source to a large number of receivers. In order to achieve reliability, data must be retransmitted in case of loss either by the source or by special network nodes, called proxies. Each proxy is responsible for reliably delivering the data to a subgroup it is assigned. The multicast t...
متن کاملConstruction of a Proxy-Based Overlay Skeleton Tree for Large-Scale Real-Time Group Communications
We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning all multicast proxies deployed in the overlay backbone, POST acts as an efficient resource sharing platform for supporting large numbers of concurrent multicast sessions, without the need of tree computation for each individua...
متن کاملRow/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips
In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first appro...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کامل